Oneway Permutations in Nc
نویسنده
چکیده
We prove that there is a family of permutations which are computable by a family ofNC circuits while their inverses are P-hard to compute. Thus these permutations are oneway from the point of view of parallel computation.
منابع مشابه
One-Way Permutations in NC0
We prove that there is a family of permutations which are computable by a family of NC 0 circuits while their inverses are P-hard to compute. Thus these permutations are oneway from the point of view of parallel computation. Warning: Essentially this paper has been published in Information Processing Letters and is hence subject to copyright restrictions. It is for personal use only. 1. Permuta...
متن کاملCharacterizations of the Existence of Partial and Total One-Way Permutations
In this note, we study the easy certificate classes introduced by Hemaspaandra, Rothe, and Wechsung [HRW], with regard to the question of whether or not surjective oneway functions exist. This is an important open question in cryptology. We show that the existence of partial one-way permutations can be characterized by separating P from the class of UP sets that, for all unambiguous polynomial-...
متن کاملPerfect Structure on the Edge of Chaos
We construct trapdoor permutations based on (sub-exponential) indistinguishability obfuscation and oneway functions, thereby providing the first candidate that is not based on the hardness of factoring. Our construction shows that even highly structured primitives, such as trapdoor permutations, can be potentially based on hardness assumptions with noisy structures such as those used in candida...
متن کاملPseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications
Pseudorandom function tribe ensembles are pseudorandom function ensembles that have an additional collision resistance property: almost all functions have disjoint ranges. We present an alternative to the construction of pseudorandom function tribe ensembles based on oneway permutations given by Canetti, Micciancio and Reingold [7]. Our approach yields two different but related solutions: One c...
متن کاملA Stream Cipher Based on Chaotic Permutations
In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1987